A two-dimensional problem of revenue maximization

نویسنده

  • Omer Lev
چکیده

We consider the problem of finding the mechanism that maximizes the revenue of a seller of multiple objects. This problem turns out to be significantlymore complex than the casewhere there is only a single object (which was solved by Myerson, 1981). The analysis is difficult even in the simplest case studied here, where there are two exclusive objects and a single buyer, with valuations uniformly distributed on triangular domains. We show that the optimal mechanisms are piecewise linear with either 2 or 3 pieces, and obtain explicit formulas for most cases of interest. © 2011 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Bi-objective Model of Hotel Revenue Management Considering Customer Choice Behavior Using Meta-heuristic Algorithms

The problem of maximizing the benefit from a specified number of a particular product with respect to the behavior of customer choices is regarded as revenue management. This managerial technique was first adopted by the airline industries before being widely used by many others such as hotel industries. The scope of this research is mainly focused on hotel revenue management, regarding which a...

متن کامل

Revenue maximization in the dynamic knapsack problem

We characterize the revenue maximizing policy in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a twodimensional type that re‡ects his capacity requirement and his willingness to pay per unit of capacity. Types are private information. We …rst characterize implementable poli...

متن کامل

Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations

It was recently shown in [12] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility constraints and independent additive bidders with arbitrary (possibly combinatorial) demand constraints. This reduction provides a poly-time solution to the optimal mechan...

متن کامل

Reducing Revenue to Welfare Maximization: Approximation Algorithms and Other Generalizations Citation

It was recently shown in [12] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly combinatorial) feasibility constraints and independent additive bidders with arbitrary (possibly combinatorial) demand constraints. This reduction provides a poly-time solution to the optimal mechan...

متن کامل

A Cross-Entropy-Based Admission Control Optimization Approach for Heterogeneous Virtual Machine Placement in Public Clouds

Virtualization technologies make it possible for cloud providers to consolidate multiple IaaS provisions into a single server in the form of virtual machines (VMs). Additionally, in order to fulfill the divergent service requirements from multiple users, a cloud provider needs to offer several types of VM instances, which are associated with varying configurations and performance, as well as di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011